/////////////////////////////////////////////////////////////////////////////
// Original code from libhdfs3. Copyright (c) 2013 - 2014, Pivotal Inc.
// All rights reserved. Author: Zhanwei Wang
/////////////////////////////////////////////////////////////////////////////
//  Modifications by Kumo Inc.
// Copyright (C) Kumo inc. and its affiliates.
// Author: Jeff.li lijippy@163.com
// All rights reserved.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published
// by the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.
//


#include <ktest/ktest.h>
#include <kmhdfs/client/lru_map.h>

using namespace Hdfs::Internal;

TEST(TestLruMap, TestInsertAndFind) {
    LruMap<int, int> map(3);
    map.insert(1, 1);
    map.insert(2, 2);
    map.insert(3, 3);
    map.insert(4, 4);
    int value = 0;
    EXPECT_TRUE(map.find(2, &value));
    EXPECT_TRUE(value == 2);
    EXPECT_TRUE(map.find(3, &value));
    EXPECT_TRUE(value == 3);
    EXPECT_TRUE(map.find(4, &value));
    EXPECT_TRUE(value == 4);
    EXPECT_FALSE(map.find(1, &value));
    EXPECT_TRUE(map.find(2, &value));
    EXPECT_TRUE(value == 2);
    map.insert(5, 5);
    EXPECT_FALSE(map.find(3, &value));
}

TEST(TestLruMap, TestFindAndErase) {
    LruMap<int, int> map(3);
    map.insert(1, 1);
    map.insert(2, 2);
    map.insert(3, 3);
    map.insert(4, 4);
    int value = 0;
    EXPECT_EQ(3u, map.size());
    EXPECT_TRUE(map.findAndErase(2, &value));
    EXPECT_TRUE(value == 2);
    EXPECT_EQ(2u, map.size());
}
